Estimation of uTf(A)v for large-scale unsymmetric matrices
نویسندگان
چکیده
Fast algorithms, based on the unsymmetric look-ahead Lanczos and the Arnoldi process, are developed for the estimation of the functional (f)= uf(A)v for xed u; v and A, where A∈Rn×n is a largescale unsymmetric matrix. Numerical results are presented which validate the comparable accuracy of both approaches. Although the Arnoldi process reaches convergence more quickly in some cases, it has greater memory requirements, and may not be suitable for especially large applications. Copyright ? 2003 John Wiley & Sons, Ltd.
منابع مشابه
An effective method for eigen-problem solution of fluid-structure systems
Efficient mode shape extraction of fluid-structure systems is of particular interest in engineering. An efficient modified version of unsymmetric Lanczos method is proposed in this paper. The original unsymmetric Lanczos method was applied to general form of unsymmetric matrices, while the proposed method is developed particularly for the fluid-structure matrices. The method provides us with si...
متن کاملEstimation of uTƒ(A)v for large-scale unsymmetric matrices
Fast algorithms, based on the unsymmetric look-ahead Lanczos and the Arnoldi process, are developed for the estimation of the functional (f)= uf(A)v for xed u; v and A, where A∈Rn×n is a large7 scale unsymmetric matrix. Numerical results are presented which validate the comparable accuracy of both approaches. Although the Arnoldi process reaches convergence more quickly in some cases, it 9 has ...
متن کاملAn exploration of matrix equilibration
We review three algorithms that scale the in nity-norm of each row and column in a matrix to 1. The rst algorithm applies to unsymmetric matrices, and uses techniques from graph theory to scale the matrix. The second algorithm applies to symmetric matrices, and is notable for being asymptotically optimal in terms of operation counts. The third is an iterative algorithm that works for both symme...
متن کاملSzeged Matrices and Related Numbers
A new unsymmetric matrix, SZu (unsymmetric Szeged matrix) is proposed by analogy to the matrix CJu (unsymmetric Cluj matrix) [1,2]. It is defined and exemplified both for acyclic and cycle-containing structures. Its relation with the CJu matrix is discussed. The derived Szeged numbers are compared to the Wiener matrixand Cluj matrixderived numbers and tested for separating and correlating abili...
متن کاملA CPU-GPU hybrid approach for the unsymmetric multifrontal method
Multifrontal is an efficient direct method for solving large-scale sparse and unsymmetric linear systems. The method transforms a large sparse matrix factorization process into a sequence of factorizations involving smaller dense frontal matrices. Some of these dense operations can be accelerated by using a graphic processing unit (GPU). We analyze the unsymmetricmultifrontalmethod fromboth an ...
متن کامل